Ergodic undefinability in set theory and recursion theory
نویسندگان
چکیده
منابع مشابه
Ergodic Theory and Number Theory
Elon Lindenstrauss was awarded the 2010 Fields Medal for his results on measure rigidity in ergodic theory, and their applications to number theory. The web page of the ICM 2010 contains the following brief description of Elon Lindenstrauss’ achievements: Lindenstrauss has made far-reaching advances in ergodic theory, the study of measure preserving transformations. His work on a conjecture of ...
متن کاملThe Uniform Regular Set Theorem in a-Recursion Theory
Several new features arise in the generalization of recursion theory on crl to recursion theory on admissible ordinals d, thus making ¿y-recursion theory an interesting theory. One of these is the appearance of irregular sets. A subset A of a is called regular (over a), if we have for all B<a that AnBeL-, otherwise A is called irregular (over ø). So in the special case of ordinary recursion the...
متن کاملFUZZY SOFT SET THEORY AND ITS APPLICATIONS
In this work, we define a fuzzy soft set theory and its related properties. We then define fuzzy soft aggregation operator that allows constructing more efficient decision making method. Finally, we give an example which shows that the method can be successfully applied to many problems that contain uncertainties.
متن کاملErgodic Theory
Ergodic theory involves the study of transformations on measure spaces. Interchanging the words “measurable function” and “probability density function” translates many results from real analysis to results in probability theory. Ergodic theory is no exception. Ergodic theory has fundamental applications in probability theory, starting from areas that are very well understood, such as finite st...
متن کاملRecursion Theory and Undecidability
In the second half of the class, we will explore limits on computation. These are questions of the form “What types of things can be computed at all?” “What types of things can be computed efficiently?” “How fast can problem XYZ be solved?” We already saw some positive examples in class: problems we could solve, and solve efficiently. For instance, we saw that we can sort n numbers in time O(n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1981
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1981-0603611-1